package 力扣.二叉树相关问题.n叉树;

import java.util.List;

public class n叉树的最大深度 {

    class Node {
        public int val;
        public List<Node> children;

        public Node() {}

        public Node(int _val) {
            val = _val;
        }

        public Node(int _val, List<Node> _children) {
            val = _val;
            children = _children;
        }
    };
    public int maxDepth(Node root) {
           if (root==null)
               return 0;
           int sum=0;
        for (Node child : root.children) {
           sum=Math.max(maxDepth(child)+1,sum);
        }
        return sum;
    }
}
